Priority based LDAP service publication mechanism

ABSTRACT

A method and system are provided for directing a client to a preferred service instance. At creation of a service instance, the service binding attribute of the created instance is extended to include assigned domains and associated priorities. There are then two phases to directing a client to the preferred service instance. The first phase is compilation of a list of domains and priorities for the service in response to a query. Upon completion of the first phase, a second phase is executed to determine a preferred service for the client by comparing fully qualified domain name entries and assigned priority entries.

BACKGROUND OF THE INVENTION

1. Technical Field

This invention relates to identifying a service instance for a clientfrom a standard directory service. More specifically, the selection ofthe service instance is based upon proximity of the client with regardto the service instance.

2. Description of the Prior Art

A directory service is a central point where network services, securityservices, and applications can form an integrated distributed computingenvironment. LDAP (Lightweight Directory Access Protocol) is a softwareprotocol for providing directory service enablement to a large number ofapplications. LDAP is a “lightweight” version of DAP (Directory AccessProtocol), which is part of X.500, a standard for directory services ina network. These applications range from e-mail to distributed systemmanagement tools. LDAP is an evolving protocol model based on theclient-server model in which a client makes a TCP/IP connection to anLDAP server.

The LDAP information model is based on an “entry”, which containsinformation about some object. Entries are typically organized in aspecified tree structure, and each entry is composed of attributes. FIG.1 is an example of an LDAP-managed domain tree shown organized in asimple tree hierarchy (10). The tree is made up of one or more domains,where a domain is a collection of one or more systems managed as asingle security entity. In this example, the root domain (12) is shownas ibm.com, with an intermediate tier (20) having two intermediate nodes(22) and (24), and a final tier (30) having four leaf nodes (32), (34),(36), and (38). Intermediate node (22) is in communication with leafnodes (32) and (34), and intermediate node (24) is in communication withleaf nodes (36) and (38). Multiple domains can be connected by trustrelationships and share a common directory schema. The domains in thetree (10) share a contiguous namespace. One or more domain trees can beconfigured to trust one another and share a common schema, but not acontiguous namespace. A trust relationship among domain trees creates aforest. Any service, and any client of that service, in the directoryforest can be located within a specified domain. Examples of a serviceinclude, but are not limited to, an instance of a service that directsclients to a Microsoft Terminal Services session running on servers in adata center. Similarly, examples of a client include, but are notlimited to, a thin client, such as a terminal, that needs to contact theinstance of the service to find out which server to connect to. Ingeneral, a network administrator would like a client to connect to aninstance of the service that is close to that client on the network,while ensuring that no one instance of the service is overloaded.

Active Directory (AD) is a specific implementation of the LDAP protocolfrom Microsoft. Microsoft has defined a scheme for publishing servicesin AD specifically, and in any LDAP-compliant directory in general. Inthis scheme, a service is represented by a directory class called aService Connection Point (SCP). An instance of the SCP class is known asan SCP object. An SCP has at least two attributes, including servicebinding information and keywords. An attribute is a field associatedwith the SCP object to store SCP object associated data. The servicebinding information of the SCP object contains binding information thata client can use to connect to a specified instance of the service. Thebinding information is stored in a string format in an SCP attributecalled Service Binding Information. The content of this string isservice specific. For example, in the case of a web service, the bindinginformation may be in the form of a URL. The keyword attribute of theSCP object is used to identify the type of service with which the SCPobject is associated. In the prior art, it is known to associate aglobal unique identifier (GUID) with each type of service and to storethe GUID in the keywords attribute. Through the SCP object and keywords,a client may locate an instance of a service. The query used to locatedthe instance of the service returns a list of multiple SCP objects tothe client. However, the returned list does not direct the client to apreferred service instance.

Therefore, there is a need for a scheme that supports automatic locationof a service on a network for a requesting client. The located serviceshould be close to the client. At the same time, management of theinstance of the service located for the client should prevent overloadof the service instance.

SUMMARY OF THE INVENTION

This invention comprises a method and system for selecting a serviceinstance for a client.

In one aspect of the invention, a method is provided for directing aclient to a preferred service instance. A directory of compiled assigneddomain and priority data for each service attribute is queried for allinstances of a service. A list of domain data and priority data for theservice is received in response to the query of the directory. The listis scanned to find a match.

In another aspect of the invention, a computer system is provided with adirectory of assigned domain data and priority data for an instance of aservice and stored in the service binding attribute for that instance.To find a preferred service instance, a client queries the directory forall instances of the service. The client receives a list of domain andpriority data for the service in response to the query. A manager scansthe list to find a match of the preferred service instance for theclient.

In a further aspect of the invention, an article is provided with acomputer useable medium embodying computer usable program code fordirecting a client to a preferred service instance. The code includesinstructions for querying a directory for all instances of a service.The service instance includes an assigned domain and priority. Code isalso provided for receiving a list of domain and priority data for theservice in response to execution of the code for querying the directory.A preferred service instance is provided in response to execution ofcomputer useable program code for scanning the generated list for amatch.

In yet a further aspect of the invention, an article is provided with acomputer useable medium embodying computer useable program code fordirecting a client to a preferred service instance. The computer programcode includes computer useable program code for receiving a query for adirectory for all instances of a service. The service instance includesassigned domain data and priority data. Computer useable program code isalso provided for generating a list of domain data and priority data forthe service in response to execution of the code for receiving a queryfor the directory. Finally, computer useable program code is providedfor communicating the generated list to a client to find a match to thepreferred service instance.

Other features and advantages of this invention will become apparentfrom the following detailed description of the presently preferredembodiment of the invention, taken in conjunction with the accompanyingdrawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a prior art domain tree managed by an LDAPdirectory.

FIG. 2 is flow chart illustrating a method for constructing a list ofbinding information items in response to a directory query according tothe preferred embodiment of this invention, and is suggested forprinting on the first page of the issued patent.

FIGS. 3 a and 3 b are flow charts illustrating a method for selecting apreferred service instance for a client from the list of bindinginformation items.

FIG. 4 is a block diagram of a server and client embodying the physicalelements of the tool.

DESCRIPTION OF THE PREFERRED EMBODIMENT Overview

A list of domains and associated priorities for an instance of a serviceare specified at the time a service instance is installed. Fullyqualified domain names (FQDNs), hereinafter referred to as domain data,are stored in a service binding attribute of a newly created serviceconnection point (SCP). A fully qualified domain name (FQDN) is thatportion of an Internet Uniform Resource Locator (URL) that fullyidentifies the server program that an Internet request is addressed to.Logic is provided to retrieve the SCPs associated with a service inwhich a requesting client is interested in accessing. This logic selectsa preferred service instance for the requesting client based upon acomparison of the domain names and the priorities stored in the SCP.

Technical Details

The following description is associated with locating a service on anetwork of interconnected computers. The SCP object's attributes areextended to include data in the form of a string at the time the serviceis installed. In one embodiment, service installation logic solicits andstores the extended data in a service binding attribute of a newlycreated SCP. The data includes a URL, domain data, and priority data.The URL is a uniform resource locator and specifies a location on thenetwork where the client can find an instance of the service. The formatof the URL is service specific. The priority data is a positive integerthat indicates how good a match the corresponding instance of theservice is for the domain data. In one embodiment, an integer value ofone may designate the highest priority. The domain data consists of ahost and a domain name, including top-level domain. For example,www.ibm.com is a fully qualified domain name, with www serving as thehost, ibm is the second-level domain, and .com is the top level domain.Domain data always starts with a host name and continues all the way upto the top-level domain name. Furthermore, domain data identifies adomain associated with the instance of the service in question.

There is no modification to the service, only to the SCP representing aninstance of the service. Following installation of the service(s) andupon querying the directory for all instances of a service, the clientwill receive a list of SCP objects, one per service instance. Eachreturned SCP object will include a string having a URL, domain data, andpriority data in a service binding information attribute. The clientmust determine the domain in which it itself resides, and then select apreferred instance of the service from the returned list.

FIG. 2 is a flow chart (100) illustrating a first part of the searchprocess which includes constructing a list of binding information items.Initially, a directory is queried for all SCPs having a globally uniqueidentifier of the desired service in the keyword attribute (102). A listof all SCPs are returned to the client initiating the query (104).Thereafter, a counting variable, n, is set to zero (106) followed by aquery (108) to determine if the list returned at step (104) is empty. Apositive response to the query at step (108) is an indication that noSCPs were returned at step (104) and a fail message is returned to theclient (110). However, a negative response to the test at step (108)will result in entering a loop for generating a list of bindinginformation items. Accordingly, the first part of the list constructingprocess extracts a list of binding information items from the directory.

After the list of all SCPs has been obtained, pairs of domain data andassociated priority data are extracted from each entry in the list. Theextraction process includes a query (112) to determine if there isanother SCP in the list returned at step (104). A positive response tothe test at step (112) will cause the next SCP in the list to beassigned the current SCP for review (114). Thereafter, a test isconducted to determine if a domain list of the current SCP under reviewis empty (116). Since a single SCP may return multiple pairs of domainand priority data, the domain list refers to a listing of pairs ofdomain and priority data. A negative response to the test at step (116)will result in use of an extraction loop to obtain an SCP output list,i.e. a list of data extracted from the domain list. For example, eachlisting in the SCP output list will include a URL, domain data, andpriority data. The next domain entry is assigned the position of thecurrent domain entry (118), followed by extracting the URL of thecurrent SCP and assigning it to a variable (120), extracting the domaindata of the current domain entry and assigning it to a variable (122),and extracting the priority of the current domain entry and assigning itto a variable (124). Each of the variable assignments at steps (120),(122), and (124) are preferably associated with the current value of thecounting variable, n. At the end of step (124), the counting variable,n, is incremented. Following step (124), a test (126) is conducted todetermine if there is another domain entry in the list returned at step(104). A positive response to the test at step (126) will result in areturn to step (118). Similarly, a negative response to the test at step(126) will result in a return to step (112). Accordingly, for each SCPin the list in which the domain list is not empty, the URLs, the domaindata, and the priority data are extracted and assigned to variables.

If a response to the test at step (116) is positive, this is anindication that the domain list of the SCP under review is empty. TheURL of the current SCP is extracted and assigned to a variable (128). Adomain data variable of the current SCP is set to an empty string (130),and the priority of the current SCP is set to the largest integer valuethat can be represented by an integer on the system (132). Each of thevariable assignments at steps (128), (130), and (132) are preferablyassociated with the current value of the counting variable, n. Followingstep (132), the counting variable n is incremented (134), and theprocess returns to step (112). At such time as a negative response tothe test at step (112) is received, this an indication that there are nomore SCPs in the list generated at step (104). A variable, listsize,representing the size of the list is then set to the current value ofthe counting variable, n, (136) to indicate how many pairs of domaindata and priority data were extracted from the list returned at step(104). Accordingly, the first part of the process illustrates extractingthe binding information data from the SCP list in response to adirectory query.

Once the binding information list is constructed, the client can scanthis list to find the URL in the list that provides the preferredservice instance for the client. FIG. 3 is a flow chart (200)illustrating a process of finding a preferred service instance.Initially, a test is conducted to determine if the size of the list asassigned at step (136) is greater than zero (202). A negative responseto the test at step (202) will result in setting the URL to an emptystring (204). However, a positive response to the test at step (202)will result in finding the domain in which the client is located (206).In one embodiment, the query at step (206) is conducted in the form of asystem call to determine the client's domain. Following step (206), thefirst entry in the list generated in FIG. 2 is reviewed. The URL of thefirst entry in the list is assigned a variable (208). The domain data ofthe first entry in the list is assigned a variable (210), and thepriority of the first entry in the list is assigned a variable (212).The assignments in steps (208), (210), and (212) are all saved inmemory. Each of the assignments at steps (208), (210), and (212) takesthe first entry in the list generated in FIG. 2 and assumes the firstentry is the preferred service instance for the client. Following theassignments for the URL, domain data, and priority data, the countingvariable, n, is set to zero (214). Accordingly, the first part of theprocess for finding the preferred service instance saves the informationof the first service instance in the binding information list in memory.

Following step (214), the remainder of the binding information list isscanned to determine if there is an entry in the list that is a betterservice instance for the client. The first step in the scanning processis to increment the counting variable, n (216). Thereafter, a test isconducted to determine if there is another entry in the list (218). Inone embodiment, the test at step (218) may determine if the countingvariable is less than the variable associated with the size of the list.A negative response to the test at step (218) is an indication thatthere are no more entries in the list to review and the currentassignment set at steps (208), (210), and (212) identifies the bestservice instance for the client (220). However, a positive response tothe test at step (218) will result in a test to determine if the nextdomain data entry in the binding information list is a better fit forthe client's domain than the current domain assignment to the client(222). A better fit is one that involves a more specific match of domaindata to the client's domain. Meaning, a better match will have morecomponents of the domain data. For example, if the client is in domainhosted.clients.ibm.com, a service instance serving any of“hosted.clients.ibm.com”, “clients.ibm.com”, “ibm.com”, or an emptystring would be acceptable, but the most specific match is to bepreferred. So, in this case, instances serving the specific domainhosted.clients.ibm.com would be preferred. An instance with an emptydomain list can serve clients in any domain, but is considered the mostgeneral match, and thus chosen only as a last resort. A positiveresponse to the test at step (222) will result in setting the URL of thecurrent entry in the list and assigning it to a variable reflective ofthe current entry (224). In addition, the domain data of the currententry in the list is assigned a variable reflective of the current entry(226), and the priority of the current entry in the list is set to avariable reflective of the current entry (228). The assignments in steps(224), (226), and (228) are all saved in memory and replace any priorentry that was previously saved in memory. Similarly, a negativeresponse to the test at step (222) will result in a test to determine ifthe next domain in the binding information list is an equally good fitfor the client's domain as the current domain assignment to the client(230). The next domain and the current domain are equally good fits forthe client's domain if the two domains are identical, including the casewhere both FQDNs are blank. A positive response to the test at step(230) will result in a final test for the current entry in the list todetermine if the priority for the current entry in the bindinginformation list is less than the current priority assignment to theclient (232). The test at step (232) is calibrated for a system where alower value priority integer reflects a higher priority rating. In thecase of a system calibrated for the opposite logic, the test at step(232) may be reversed. A positive response to the test at step (232)results in setting the URL of the current entry in the list andassigning it to a variable reflective of the current entry (234). Inaddition, the domain data of the current entry in the list is assigned avariable reflective of the current entry (236), and the priority of thecurrent entry in the list is set to a variable reflective of the currententry (238). The assignments in steps (234), (236), and (238) are allsaved in memory and replace any prior entry that was previously saved inmemory. Following step (228), (238), or a negative response to the testsat steps (230) or (232), the process returns to step (216). Accordingly,the process of selecting the best service instance for the cliententails comparing domain data and priority data for entries in thebinding information list.

If at the conclusion of the process outlined in FIG. 3 the URL is empty,this indicates a failed search. Conversely, if the URL is not empty, theclient may attempt to connect to the URL assigned to the client with thelogic presented in FIG. 3. A failed connection attempt will cause thecorresponding entries in the binding information list to be removed fromthe list. The client can then enter the process for parsing the datafrom the list, as outlined in FIG. 3, until the client finds aresponsive service instance or exhausts all service instances.

The method for directing a client to a preferred service instance may beinvoked in the form of a tool that includes a directory embedded withina server and a manager embedded within a client, wherein the client andserver communicate across a network connection. FIG. 4 is a blockdiagram (400) of a server (420) and a client (430). As shown, the server(420) includes memory (424) with a directory (426) embedded therein. Theserver (420) includes a connection (422) to a network (440). Similarly,the client (430) includes memory (434) with a client manager (436)embedded therein. The client (420) also includes a connection (432) tothe network (440). The quantity of servers and clients are merely anillustrative quantity. The system may be enlarged to include additionalclients and servers. The directory (426) maintains assigned domains andpriorities in a service binding attribute for an instance of a service.As noted above, the associated domains and priorities are solicited atthe time a service is installed. The manager (436) is a tool thatqueries the directory for all instances of a specified service. Themanager (436) generates a list of domains and priorities of thespecified service. In addition to generating the list, the clientmanager (436) scans the list to select a match of the preferred serviceinstance for the client (430).

In one embodiment, the invention is implemented in software, whichincludes but is not limited to firmware, resident software, microcode,etc. The software implementation can take the form of a computer programproduct accessible from a computer-useable or computer-readable mediumproviding program code for use by or in connection with a computer orany instruction execution system. As shown in FIG. 4, both the server(420) and the client (430) includes memory (424) and (434),respectively. The server memory (424) includes a directory (426)embedded therein, and the client memory (434) includes a manager (436)embedded therein. The directory and its associated information is storedwithin memory (424) of the server (420). The client manager (436) isprovided to communicate with the directory (426) of the server (420)across the network (440) to query the directory and to select apreferred service instance for the client in response to the query. Forthe purposes of this description, a computer-useable orcomputer-readable medium can be any apparatus that can contain, store,communicate, propagate, or transport the program for use by or inconnection with the instruction execution system, apparatus, or device.

Advantages Over the Prior Art

For each service instance in a directory, an administrator has tospecify a list of domains and associated priorities for each serviceinstance. The administrator does not have to specify a client in thenetwork. The binding information string that contains the domains andassociated priorities is specified at the time the service is installed.The query requires use of only two SCP attributes, the keywords and theservice binding information attributes. By specifying high prioritiesfor domains that are close to the service instance, the administratorcan locate a service instance close to the client. If the preferredservice instance for a client is not responsive, the client can selectthe next instance on the list of returned service instances.

Alternative Embodiments

It will be appreciated that, although specific embodiments of theinvention have been described herein for purposes of illustration,various modifications may be made without departing from the spirit andscope of the invention. In particular the representation of prioritiesby positive integers, or the sequence of the operations in comparing theURL, domain data, and priority data may be altered. Accordingly, thescope of protection of this invention is limited only by the followingclaims and their equivalents.

1. A method for directing a client to a preferred service instance,comprising: querying a directory of compiled assigned domain andpriority data to each service attribute for all instances of a service;receiving a list of domain data and priority data for said service inresponse to said query; and scanning said list for a match.
 2. Themethod of claim 1, wherein the step of compiling a directory of assigneddomain data and priority data includes each item in said directoryhaving a fully qualified domain name and an associated priority.
 3. Themethod of claim 2, wherein said list includes one item per pair of fullyqualified domain name and an associated priority.
 4. The method of claim1, wherein the step of scanning said list for a match includesidentifying a preferred service instance for said client.
 5. The methodof claim 4, further comprising determining a preferred service for aclient based upon a comparison of a domain data entry in said list witha domain data assignment to said client.
 6. The method of claim 5,further comprising determining a preferred service for said client basedupon a comparison of a priority entry in said list with a priorityassignment to said client in response to a comparison of said domaindata entries resulting in maintaining a current client assignment.
 7. Acomputer system comprising: a client adapted to query a directory ofassigned domain data and priority data for each service bindingattribute to search for all instances of a service, and to receive alist of domain data and priority data of said service; and a manageradapted to scan said list to find a match for said client.
 8. The systemof claim 7, wherein said directory having a fully qualified domain nameand an associated priority for each item in said directory.
 9. Thesystem of claim 7, wherein said list includes one item per pair of fullyqualified domain name and an associated priority.
 10. The system ofclaim 7, wherein said manager is adapted to identify a preferred serviceinstance for said client.
 11. The system of claim 10, further apreferred service for said client identified by said manager uponcomparison of a domain data entry in said list with a domain dataassignment to said client.
 12. The system of claim 11, furthercomprising a preferred service for said client identified by saidmanager in response to a comparison of a priority entry in said listwith a priority assignment to said client if said comparison of domaindata entries results in maintenance of a service instance domainassignment.
 13. An article comprising: a computer useable mediumembodying computer usable program code for directing a client to apreferred service instance, said computer program code including:computer useable program code for querying a directory for all instancesof a service, wherein said service instance includes assigned domaindata and priority data; computer useable program code for receiving alist of domain data and priority data for said service in response toexecution of said code for querying said directory; and computer useableprogram code for scanning said generated list for a match.
 14. Thearticle of claim 13, wherein said list generated by said computeruseable program code includes one item per pair of fully qualifieddomain name and an associated priority.
 15. The article of claim 13,wherein said computer useable program code for scanning said generatedlist for a match identifies a preferred service instance for saidclient.
 16. The article of claim 15, further comprising computer useableprogram code for comparing a domain data in said list with a domain dataassignment to said client to determine a preferred service for saidclient.
 17. The article of claim 16, further comprising computer useableprogram code for comparing a priority entry in said list with a priorityassignment to said client to determine a preferred service for saidclient in response to said program code for comparison of said domaindata resulting in maintaining a service instance domain assignment. 18.An article comprising: a computer useable medium embodying computerusable program code for directing a client to a preferred serviceinstance, said computer program code including: computer useable programcode for receiving a query for a directory for all instances of aservice, wherein said service instance includes assigned domain data andpriority data; computer useable program code for generating a list ofdomain data and priority data for said service in response to executionof said code for receiving a query for said directory; and computeruseable program code for communicating said generated list to a clientto find a match to said preferred service instance.